Papers with text classifier

20 papers
LUX (Linguistic aspects Under eXamination): Discourse Analysis for Automatic Fake News Classification (2021.findings-acl)

Copied to clipboard

Challenge: Automated fact-checking is time-consuming and cannot scale due to a lack of suitable training data.
Approach: They propose to use a dataset to automatically check facts and a text classifier to infer the likelihood of the input being a piece of fake-news.
Outcome: The proposed dataset VERITAS and LUX use linguistic analysis to infer the likelihood of the input being a piece of fake-news.
R&R: Metric-guided Adversarial Sentence Generation (2022.findings-aacl)

Copied to clipboard

Challenge: Existing methods prioritize misclassification by maximizing each perturbation’s effectiveness at misleading a text classifier.
Approach: They propose a rewrite and rollback framework for adversarial attack that optimizes a critique score which combines fluency, similarity, and misclassification metrics.
Outcome: The proposed framework outperforms current state-of-the-art in attack success rate by +16.2%, +12.8%, and +14.0% on the classifiers respectively.
SELFEXPLAIN: A Self-Explaining Architecture for Neural Text Classifiers (2021.emnlp-main)

Copied to clipboard

Challenge: Existing models that explain text classification predictions are opaque and overfit to spurious artifacts.
Approach: They propose a novel self-explaining model that explains a text classifier’s predictions using phrase-based concepts.
Outcome: The proposed model shows that it is adequate, trustworthy and understandable by human judges compared to existing baselines.
T3L: Translate-and-Test Transfer Learning for Cross-Lingual Text Classification (2023.tacl-1)

Copied to clipboard

Challenge: Existing approaches to cross-lingual text classification leverage text classifiers trained in a high-resource language to perform text classification in other languages with no or minimal fine-tuning.
Approach: They propose to combine a neural machine translator and a text classifier trained in a high-resource language to perform text classification in other languages with no or minimal fine-tuning.
Outcome: The proposed approach significantly improves over a baseline approach.
HyperText: Endowing FastText with Hyperbolic Geometry (2020.findings-emnlp)

Copied to clipboard

Challenge: Empirically, we show that HyperText outperforms FastText on a range of text classification tasks with much reduced parameters.
Approach: They propose a model that uses hyperbolic geometry to model tree-like hierarchies in natural language sentences by embedding words or ngrams in hyperbolical space.
Outcome: Empirically, the proposed model outperforms FastText on a range of text classification tasks with much reduced parameters.
Stochastic Tokenization with a Language Model for Neural Text Classification (P19-1)

Copied to clipboard

Challenge: Sentences segmented with words or subwords can be difficult to perform text classification tasks.
Approach: They propose a method to learn tokenization and text classification simultaneously to address these problems.
Outcome: The proposed method improves on sentiment analysis in Japanese and Chinese using tokenization and text classification models.
Combining Counting Processes and Classification Improves a Stopping Rule for Technology Assisted Review (2023.findings-emnlp)

Copied to clipboard

Challenge: Experiments on multiple data sets show that the proposed approach consistently improves performance and outperforms several alternative methods.
Approach: They propose to integrate a text classifier into an existing TAR stopping rule to train it without the need for additional annotations.
Outcome: Experiments on multiple data sets show the proposed approach outperforms other methods and achieves the desired level of recall with a lower cost than the existing method based on counting processes alone.
Text Grafting: Near-Distribution Weak Supervision for Minority Classes in Text Classification (2024.emnlp-main)

Copied to clipboard

Challenge: Recent work generates pseudo labels by mining texts similar to the class names from the raw corpus, but there is a high risk that LLMs cannot generate in-distribution data, leading to ungeneralizable classifiers.
Approach: They propose to use LLMs to generate pseudo labels by mining masked templates from corpus . they then use state-of-the-art LLM to synthesize near-distribution texts falling into minority classes .
Outcome: The proposed framework improves on the previous methods for extremely weak-supervised text classification.
Incubating Text Classifiers Following User Instruction with Nothing but LLM (2024.emnlp-main)

Copied to clipboard

Challenge: In this paper, we aim to generate text classification data given arbitrary class definitions . Traditional supervised text classification fine-tunes models on expensive human annotation .
Approach: They propose a framework that can generate text classification data given arbitrary class definitions . they use instruction-to-data mappings and in-context augmentation to refine the framework .
Outcome: The proposed framework outperforms existing methods on benchmarks and training data generation by prompt engineering.
Weakly-supervised Text Classification Based on Keyword Graph (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods for text classification ignore keyword correlation, thus ignoring it . existing methods treat keywords independently, thus not exploiting correlation between them .
Approach: They propose a framework to explore keyword-keyword correlation on keyword graph by GNN . they use a self-supervised task to pretrain annotators and fine-tune them .
Outcome: The proposed method outperforms existing methods on long- and short-text datasets.
X-Class: Text Classification with Extremely Weak Supervision (2021.naacl-main)

Copied to clipboard

Challenge: Weak supervision is a problem in text classification, but it requires corpusspecific knowledge.
Approach: They propose a framework for extremely weak supervision that can be used to train a text classifier.
Outcome: The proposed framework outperforms seed-driven weakly supervised methods on 7 benchmark datasets.
Dynamic Top-k Estimation Consolidates Disagreement between Feature Attribution Methods (2023.emnlp-main)

Copied to clipboard

Challenge: Feature attribution scores are used to explain the prediction of a text classifier to users by highlighting a k number of tokens.
Approach: They propose to determine the number of optimal k tokens that should be displayed from sequential properties of attribution scores.
Outcome: The proposed method is dynamic across sentences, method-agnostic, and deals with sentence length bias.
Disentangling Task Relations for Few-shot Text Classification via Self-Supervised Hierarchical Task Clustering (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for Few-Shot Text Classification are limited by their global knowledge-shared mechanisms.
Approach: They propose a self-supervised hierarchical task clustering method to address task heterogeneity . they use prior knowledge from historical tasks to leverage prior knowledge .
Outcome: The proposed method can learn a classifier efficiently with few examples . it disentangles the underlying relations between tasks to improve interpretability .
SMAB: MAB based word Sensitivity Estimation Framework and its Applications in Adversarial Text Generation (2025.naacl-long)

Copied to clipboard

Challenge: a scalable approach to classify text with sensitivity is costly because of exponential time complexity.
Approach: They propose a framework for calculating word-level local and global sensitivities . they use a CHECKLIST-generated sentiment analysis dataset to test their approach .
Outcome: The proposed framework can be used to calculate word-level local and global sensitivities . it improves attacks by 15.58%, while using sensitivity as an additional reward improves .
Context-based Virtual Adversarial Training for Text Classification with Noisy Labels (2022.lrec-1)

Copied to clipboard

Challenge: Recent studies show that deep neural networks can memorize noisy labels with limited training time.
Approach: They propose a virtual adversarial training method to prevent a classifier from overfitting to noisy labels.
Outcome: The proposed method performs the adversarial training in the context rather than the inputs.
MEGClass: Extremely Weakly Supervised Text Classification via Mutually-Enhancing Text Granularities (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for text classification use human annotations or a set of class seed words for supervision, which can be costly, especially in emerging domains.
Approach: They propose a weakly-supervised method that leverages mutually-enhancing text granularities to learn a contextualized document representation that captures the most discriminative class indicators.
Outcome: Extensive experiments on seven benchmark datasets show that MEGClass outperforms other weakly and extremely weakly supervised methods.
What does a Text Classifier Learn about Morality? An Explainable Method for Cross-Domain Comparison of Moral Rhetoric (2023.acl-long)

Copied to clipboard

Challenge: Existing methods to analyze whether a text classifier learns the domain-specific expression of moral language are lacking.
Approach: They propose a method to compare a supervised classifier’s representation of moral rhetoric across domains by exploring similarities and differences between moral concepts and domains.
Outcome: The proposed method compares a supervised classifier’s representation of moral rhetoric across domains and domains.
WeDef: Weakly Supervised Backdoor Defense for Text Classification (2022.emnlp-main)

Copied to clipboard

Challenge: Existing backdoor defense methods are only effective for limited trigger types . Existing methods only work against certain types of triggers .
Approach: They propose a weakly supervised backdoor defense framework WeDef to defend different trigger types at once . they define reliability of samples based on whether predictions agree with their labels .
Outcome: The proposed framework outperforms existing backdoor defense methods against popular trigger-based attacks.
XVD: Cross-Vocabulary Differentiable Training for Generative Adversarial Attacks (2024.lrec-main)

Copied to clipboard

Challenge: Existing approaches to create adversarial examples using tokens are not sufficient to ensure other desirable properties such as similarity to non-adversarial examples, linguistic fluency, and so forth.
Approach: They propose a method which leverages a set of pretrained language models to promote similarity to non-adversarial examples, linguistic fluency, and so forth.
Outcome: The proposed approach outperforms existing methods and is competitive with token-based approaches.
EDUMATH: Generating Standards-aligned Educational Math Word Problems (2026.acl-long)

Copied to clipboard

Challenge: Math word problems (MWPs) are critical elements of K-12 math education and can be customized to students' interests and ability levels.
Approach: They propose that LLMs can generate MWPs customized to student interests and math education standards by using an open and closed LLM to evaluate over 11,000 MWps and develop a teacher-annotated dataset for standards-aligned educational MWPS generation.
Outcome: The proposed model outperforms existing closed models without training and is more similar to human-written MWPs but prefers customized MWPS with grade school students.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations